Distance Spectrum of Channel Trellis Codes on Precoded Partial-response 1-d Channel
نویسندگان
چکیده
Distance spectrum is the main factor in determining the event error probability when maximum-likelihood decoding is used for convolutional codes [13]. In this paper we compute the distance spectrum for the best R=1/N channel codes obtained using convolutional (linear trellis) codes together with known offset sequence addition on precoded partial-response 1−D channel proposed in [4]. To this end we have modified the BIFAST algorithm [11] in order to enable the distance spectrum evaluation in the supper-trellis [1], a technique necessary for this type of channel codes.
منابع مشابه
A Class of Trellis-Codes for Partial Response Channel
We present a new class of trellis-codes for partial-response channel. Our code con guration is based on the coded 1 D scheme due to Wolf and Ungerboeck. However, no precoder between a convolutional encoder and the partialresponse channel is used. A new lower bound on the minimum free squared Euclidean distance of channel code is shown. The bound is available for any PR channel with a nite respo...
متن کاملOn saving decoder states for some trellis codes and partial response channels
Wolf and Ungerboeck [ 11 considered constructing good trellis codes for transmitting information over a partial response channel where the decoder is matched both to the redundancy of the code and to the intersymbol interference generated by the channel. A method of constructing these trellis codes suggested by Wolf and Ungerboeck was to utilize a binary convolutional code with 2 (I states and ...
متن کاملError Propagation Assessment of Enumerative Coding Schemes Kees
2591 consisting of two four-state trellises. To this point, though, no new codes comparable to, for example, the rate 4=5 and the rate 8=9 MTR codes in [10] for the (1 0 D) (1 + D) 3 and (1 0 D) (1 + D) 4 channels have been found. For future work, an interesting research problem would be to relax the trellis-matching constraint to enlarge the constellations, thus obtaining higher-rate codes. Of...
متن کاملA multilevel approach to constructing trellis-matched codes for binary-input partial-response channels
The multilevel coding approach of Imai and Hirakawa is used to construct trellis-matched codes for binary-input partial-response channels. For the codes to be trellis-matched, the signal constellations are selected according to certain constraints, but no conditions are imposed on the component codes. New codes for the (1 D) (1 + D)n channel compare favorably to existing codes.
متن کاملOptimal Finite Alphabet Sources over Partial Response Channels
Optimal Finite Alphabet Sources Over Partial Response Channels. (August 2003) Deepak Kumar, B. Tech., Indian Institute of Technology, Bombay Co–Chairs of Advisory Committee: Dr. Scott L. Miller Dr. Krishna R. Narayanan We present a serially concatenated coding scheme for partial response channels. The encoder consists of an outer irregular LDPC code and an inner matched spectrum trellis code. T...
متن کامل